搜索资源列表
ACO
- ant colony algorithm for tsp problem
ACOTSP-1.02
- aco tsp algorithm to matlab
TSP
- Solving Traveling Salesman Problem (TSP) With Ant Colony Optimization (ACO)
dynamic-ACO-for-TSP
- 动态蚁群算法（ACO）求解（旅行商）TSP问题-Dynamic ant colony algorithm (ACO) to solve the problem (TSP) TSP
aco
- 一个简单的蚁群算法示例，实现tsp问题的路径选择。用了ant 和project两个类，实现简单-Ant Colony Algorithm
ACO
- 基于蚁群算法的机器人的路径规划问题蚁群算法，一种与传统的数学规划原理截然不同的，模拟自然生态系统以求解复杂优化问题(如NPC(NP Complete)类问题，典型的有TSP(Traveling Saleman Problem)问题)的仿生优化算法，因其较强分布式计算机制、鲁棒性、易于与其他方法相结合等优点，使得蚁群算法具有较广泛应用领域，为那些最优化技术难以解决的组合优化问题提供了一类新的切实可行的解决方案。从最初的一维的静态优化问题扩展到多维的动态组合优化问题，包括车辆路径规划，工程设计，电力
ACO-for-TSP
- a ant colony optimization(aco) for traveling salesman problem(TSP).implementation in matlab.type of file:m file
ACO-for-three-well-known-TSP-problem
- 该程序是以蚁群系统为模型写的蚁群算法程序(强调：非蚂蚁周模型)，以三个著名的TSP问题为测试对象。通过微调参数，都可以获得较好的解-The program is based on ant colony system algorithm for the model written procedures ( emphasis : Non- ants week model ) to three well-known TSP problem for the test object. By fine-tu
ACO-for-TSP
- Ant colony for tsp(traveling sale person) in matlab
ACO
- 蚁群算法求解TSP问题,在visual C++环境编写。-ACO question solution method
TSP-ACO
- 運用蟻群演算法ACO去求解TSP旅行者路徑問題-Using ant algorithm to solve TSP travelers ACO path problem
TSP Ants
- Solves TSP using ACO
TSP-Ants
- Solves TSP using ACO
ACO
- aco解决tsp问题 matlab源码 可做为学习参考-Ant intelligent algorithm to solve the traveling salesman problem
ACO-for-TSP-wavesoft.ir_
- Ant Colony optimazation code for TSP
TSP
- 蚁群算法（ACO），用于解决城市旅行商（TSP）问题-Ant colony algorithm for solving TSP problem
ACA-----TSP
- 蚁群算法ACO应用于TSP问题，MATLAB程序代码，具有详细解释，运行正确-ACO ACO algorithm is applied to the TSP, MATLAB code, with a detailed explanation of the correct operation
ACO
- ant colony for tsp problem
ACOTSPJava-1.0.3-1.0.1
- ACO tsp in Java A Java implementation of ACO algorithms for the TSP This software provides an implementation of various Ant Colony Optimization (ACO) algorithms for the symmetric Traveling Salesman Problem (TSP).
TSP-ACO
- 蚁群算法解决经典的TSP问题，自己做的，测试不错，可以用-Ant colony algorithm to solve the classic TSP, do it yourself, test good, you can use